Adaptive Clustering in Wireless Sensor Network: Considering Nodes with Lowest- Energy

In recent years, wireless sensor networks (WSNs) have gained increasing attention from researchers and scholars. One of the major issues in wireless sensor network is developing an energy-efficient clustering protocol. Hierarchical clustering algorithms are very important in increasing the network’s life time. Each clustering algorithm is composed of two stages, the setup stage and steady stage. The most important point in this algorithm is cluster head selection. Cluster head selection is important because, a good clustering guarantees energy efficiency and load balancing in the network. For load balancing in WSNs, network overload should be removed from the weak nodes (nodes with lower residual energy) and transmitted to the more powerful nodes. In this paper weak nodes decide which node become cluster head. Weak node choice cluster head based on node’s weight. This weight is combined of residual energy and distance. Finally, the simulation results demonstrate that our proposed distributed clustering approach is more effective in prolonging the network life-time compared with LEACH.